Complete theory - PDFSEARCH.IO - Document Search Engine

Complete theory
Results: 1780

#	Item
701	On Explaining Integer Vectors by Few Homogenous Segments Robert Bredereck? , Jiehua Chen?? , Sepp Hartung, Christian Komusiewicz, Rolf Niedermeier, and Ondˇrej Such´ y? ? ? Institut f¨ Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2013-05-07 04:32:27 Abstract algebra Linear algebra NP-complete problems Computational complexity theory Vectors Parameterized complexity Kernelization FO Parameter Algebra Mathematics Theoretical computer science
702	A 2.5 Factor Approximation Algorithm for the k-MST Problem Sunil Arya∗ H. Ramesh† Add to Reading List Source URL: www.cse.ust.hk Language: English - Date: 2006-04-04 10:31:23 NP-complete problems Spanning tree Network theory Minimum spanning tree Shortest path problem Tree Graph Approximation algorithm Steiner tree problem Theoretical computer science Graph theory Mathematics
703	Saturn: A SAT-based Tool for Bug Detection? Yichen Xie and Alex Aiken Computer Science Department Stanford University {yxie,aiken}cs.stanford.edu Add to Reading List Source URL: theory.stanford.edu Language: English - Date: 2005-05-20 18:05:46 Formal methods Electronic design automation Logic in computer science NP-complete problems Model checking Data types Boolean satisfiability problem Ada Pointer Computing Software engineering Theoretical computer science
704	IEEE/ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, VOL. XX, NO. X, JANUARY 201X 1 Partitioning Biological Networks into Highly Connected Clusters Add to Reading List Source URL: fpt.akt.tu-berlin.de Language: English - Date: 2014-01-08 11:56:00 NP-complete problems Degeneracy Vertex cover Kernelization Neighbourhood Clique Graph operations Connectivity Tree Graph theory Mathematics Theoretical computer science
705	Chicago Journal of Theoretical Computer Science The MIT Press Volume 1999, Article 8 Lower Bounds for Linear Satisfiability Problems ISSN 1073–0486. MIT Press Journals, Five Cambridge Center, Cambridge, Add to Reading List Source URL: cjtcs.cs.uchicago.edu Language: English - Date: 1999-10-13 17:17:56 Computational complexity theory Abstract algebra Linear algebra NP-complete problems Logic in computer science Boolean satisfiability problem Time complexity PP Element distinctness problem Theoretical computer science Mathematics Algebra
706	Microsoft PowerPoint - K-Anonymity.ppt Add to Reading List Source URL: www.andrew.cmu.edu Language: English - Date: 2012-08-22 17:30:01 NP-complete problems Graph partition Graph Matching Hypergraph Domatic number Graph theory Theoretical computer science Mathematics
707	Approximating k-center in planar graphs David Eisenstat∗ Philip N. Klein∗ Abstract Add to Reading List Source URL: www.di.ens.fr Language: English - Date: 2013-10-10 10:36:31 NP-complete problems Graph operations Dominating set Neighbourhood Tree decomposition Tree Planar graph Graph Degree Graph theory Mathematics Theoretical computer science
708	Leveraging Belief Propagation, Backtrack Search, and Statistics for Model Counting Lukas Kroc, Ashish Sabharwal, Bart Selman Cornell University May 23, 2008 Add to Reading List Source URL: www.cs.cornell.edu Language: English - Date: 2009-02-12 00:13:50 Complexity classes Boolean algebra Constraint programming Mathematical optimization Boolean satisfiability problem Constraint satisfaction problem NP-complete Belief propagation NP Theoretical computer science Computational complexity theory Applied mathematics
709	Uriel Feige, Publications, JanuaryPapers are sorted by categories. For papers that have more than one version (typically, journal version and conference proceedings), the diﬀerent versions are combined into one Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2015-01-02 09:14:39 Uriel Feige NP-complete problems Computational complexity theory Adi Shamir Symposium on Theory of Computing International Colloquium on Automata Languages and Programming Symposium on Foundations of Computer Science Approximation algorithm Uriel Theoretical computer science Applied mathematics Mathematics
710	Hardness of Set Cover with Interse tion 1 V.S.Anil Kumar1 , Sunil Arya2 and H.Ramesh3 MPI fur Informatik, Saarbru ken. kumarmpi-sb.mpg.de Department of Computer S ien e, Hong Kong University of S ien e and Te hnology. Add to Reading List Source URL: www.cse.ust.hk Language: English - Date: 2006-04-04 10:28:02 NP-complete problems Set cover problem Randomized algorithm Theoretical computer science Computational complexity theory Mathematics

UPDATE